A memetic algorithm for solving rich waste collection problems

Inspired by a real-life case in the Brussels Capital Region, Belgium, this paper provides Memetic Algorithm with Sequential Split procedure (MASS) for solving large variety of waste collection problems multiple depots, restricted vehicle fleet at each depot, (intermediate) processing facilities, capacity restrictions per facility and partial pick-ups. MASS first generates satisfactory initial solutions which are feasible w.r.t. shift duration using novel (1) giant tour is split into routes, (2) intermediate facilities introduced (3) pick-ups can be further if profitable. Second, improves these through local search. New test instances created, used to evaluate performance MASS’s components. We show that high-quality comparing an exact approach on small example. Furthermore, tested existing multiple-depot routing problem (MDVRP), (multi-depot) ((MD)VRPIF) multi-depot inter-depot routes (MDVRPI). shows competitive results MDVRP, VRPIF MDVRPI. For MDVRPIF, obtains better than those currently found literature. To assess its practical value, solve Region alternative scenarios municipal bio-waste treatment compared.